Specializing the Logic of Multiple-Valued Argumentation to the Jaina Seven-Valued Logic
نویسندگان
چکیده
Argumentation is a dialectical process of knowing things (inquiry) and justifying them (advocacy) in general. Computational argumentation has been recognized as a social computing mechanism or paradigm in the multi-agent systems community. We have developed a computational argumentation framework that basically consists of EALP (Extended Annotated Logic Programming) and LMA (Logic of Multiplevalued Argumentation) constructed on top of EALP. EALP is a very generic knowledge representation language for uncertain arguments, and LMA built on top of it also yields a generic argumentation framework so that it allows agents to construct uncertain arguments under truth values specified depending on application domains. In this paper, we specialize such a generic argumentation system to an argumentation system that can deal with Eastern arguments based on the Jaina seven-valued logic. We illustrate this specialization using the implemented argumentation system: PIRIKA (Pilot of the Right Knowledge and Argument) based on EALP and LMA, which is now opened to the public as an open source software. Keywords-multiple-valued argumentation, neural net argumentation, syncretic argumentation, argument mining, argument animation
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملA Novel Design of Quaternary Inverter Gate Based on GNRFET
This paper presents a novel design of quaternary logic gates using graphene nanoribbon field effect transistors (GNRFETs). GNRFETs are the alternative devices for digital circuit design due to their superior carrier-transport properties and potential for large-scale processing. In addition, Multiple-valued logic (MVL) is a promising alternative to the conventional binary logic design. Sa...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملTheory of multiple-valued defeasible argumentation and its applications
This paper provides a new departure from the traditional twovalued argumentation frameworks. We address ourselves to formalize an expressive logic of argumentation, called a Logic of Multiple-valued Argumentation (LMA), on top of the very expressive knowledge representation language, called Extended Annotated Logic Programming (EALP), and examine its logical properties in various ways. EALP all...
متن کامل